b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1

Source URL: www.zaik.uni-koeln.de

• Graph theory
• Graph coloring
• Matching
• NP-complete problems
• Combinatorial optimization
• Graph operations
• Blossom algorithm
• Bipartite graph
• Chordal graph
• Complete coloring
• Cograph
• Ear decomposition

Leveraging Memory Mapping for Fast and Scalable Graph Computation on a PC Zhiyuan Lin College of Computing Georgia Tech Atlanta, GA, USA

Source URL: www.cc.gatech.edu

• Mathematics
• Graph theory
• Combinatorial optimization
• Discrete mathematics
• Crowdsourcing
• PageRank
• Reputation management
• Search engine optimization
• Graph
• Matching

SEAProgram Monday, June 29th 8:00 8:50 9:00

Source URL: sea2015.lip6.fr

• NP-complete problems
• Computational complexity theory
• Steiner tree problem
• Combinatorial optimization
• Shortest path problem
• Mathematical optimization
• Independent set
• Combinatorics
• Graph theory
• Book:Graph Theory

Local Constraints in Combinatorial Optimization Madhur Tulsiani Institute for Advanced Study Local Constraints in Approximation Algorithms

Source URL: ttic.uchicago.edu

A Note on the Nearest Neighbor in Growth-Restricted Metrics Kirsten Hildrum John Kubiatowicz Sean Ma Satish Rao

Source URL: www.oceanstore.org

• Mathematics
• Search algorithms
• Distributed data storage
• Information science
• Discrete mathematics
• Combinatorial optimization
• Routing algorithms
• Data mining
• Nearest neighbor search
• Distance oracle
• A* search algorithm
• Tapestry

Photo or figure (optional) Methodology for generating extreme traffic demand patterns with optimization techniques Mireia Roca-Riu, ETH Zürich

Source URL: www.strc.ch

• Operations research
• Mathematical optimization
• Mathematics
• Applied mathematics
• Numerical analysis
• Combinatorial optimization
• Metaheuristics
• Cybernetics
• Genetic algorithm
• Tabu search
• Local search
• Heuristic

´ ry Research Group Egerva on Combinatorial Optimization Technical reportS TRPublished by the Egerv´ary Research Group, P´azm´any P. s´et´any 1/C,

Source URL: www.cs.elte.hu

Algebraic Algorithms for Matching Ioana Ivan, Madars Virza, Henry Yuen December 14, 2011 1

Source URL: madars.org

• Mathematics
• Graph theory
• Algebra
• Matching
• Combinatorial optimization
• Linear algebra
• Matrix theory
• Algebraic graph theory
• Bipartite graph
• Tutte matrix
• SchwartzZippel lemma
• Determinant

Directed Graph Exploration Klaus-Tycho Foerster and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {k-t.foerster,wattenhofer}@tik.ee.ethz.ch

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Combinatorial optimization
• Edsger W. Dijkstra
• Routing algorithms
• Search algorithms
• Graph traversal
• Shortest path problem
• A* search algorithm
• Directed graph
• Matching
• Connectivity

On the Computational Complexity of ReoptimizationScientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Approximation algorithms
• NP-complete problems
• Complexity classes
• Theoretical computer science
• Travelling salesman problem
• APX
• Optimization problem
• Combinatorial optimization
• Genetic algorithm
• Heuristic
• Steiner tree problem